A Computability Theoretic Equivalent to Vaught’s Conjecture
نویسنده
چکیده
We prove that, for every theory T which is given by an Lω1,ω sentence, T has less than 2א0 many countable models if and only if we have that, for every X ∈ 2 on a cone of Turing degrees, every X-hyperarithmetic model of T has an X-computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaught’s conjecture.
منابع مشابه
Computability-theoretic complexity of countable structures
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and...
متن کاملVaught’s Conjecture for Modules over a Dedekind Prime Ring
Vaught’s conjecture says that for any countable (complete) first-order theory T, the number of non-isomorphic countable models of T is either countable or 2, where ω is the first infinite cardinal. Vaught’s conjecture for ω-stable theories of modules was proved by Garavaglia [6, Theorem 6]. Buechler proved that Vaught’s conjecture is correct for modules of U-rank 1 [2]. It has been shown that V...
متن کاملNon-reducibility of Isomorphism of Counterexamples to Vaught’s Conjecture to the Admissibility Equivalence Relation
Let T be a counterexample to Vaught’s conjecture. Let ET denote the isomorphism equivalence relation of T . Let Fω1 be the countable admissible ordinal equivalence relation defined on ω2 by x Fω1 y if and only if ωx 1 = ω y 1 . This note will show that in L and set-generic extensions of L, ¬(ET ≤∆11 Fω1 ). Using ZFC, if T is a non-minimal counterexample to Vaught’s conjecture, then ¬(ET ≤∆11 Fω...
متن کاملComputable Structures in Generic Extensions
In this paper, we investigate connections between structures present in every generic extension of the universe V and computability theory. We introduce the notion of generic Muchnik reducibility that can be used to to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of generic presentability, the existence of a co...
متن کاملVaught's Conjecture Without Equality
Suppose σ ∈ Lω1,ω(L) is such that all equations occurring in σ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that σ satisfies Vaught’s conjecture. In particular this proves Vaught’s conjecture for sentences of Lω1,ω(L) without equality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012